The capacity of Abelian group codes over symmetric channels
نویسندگان
چکیده
In this paper the capacity achievable by Abelian group codes when employed over symmetric channels is determined. For certain important examples, like the AWGN channel with m-PSK modulation, it follows that this capacity coincides with the corresponding Shannon capacity of these channels. In other words using Abelian group codes in this case there is no loss of capacity (as it happens for binary linear codes for binary symmetric channels). Finally, a three dimensional modulation is presented for which instead, despite its group symmetry, the use of Abelian group codes leads to a loss in capacity.
منابع مشابه
Abelian Group Codes for Source Coding and Channel Coding
In this paper, we study the asymptotic performance of Abelian group codes for the lossy source coding problem for arbitrary discrete (finite alphabet) memoryless sources as well as the channel coding problem for arbitrary discrete (finite alphabet) memoryless channels. For the source coding problem, we derive an achievable rate-distortion function that is characterized in a single-letter inform...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملPolar codes for Arbitrary DMCs
Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. Just as with “usual” polar codes, the block error probability under successive cancellation decoding is o(2−N 1/2− ), where N is the block length. The encoding and decoding in this coding scheme can be implemented with a complexity of O(N logN). It is shown that the same techn...
متن کاملAnalysis of Serial Turbo Codes over Abelian Groups for Symmetric Channels
In this paper we study serial turbo interconnections of Abelian group codes to be used on symmetric channels. Particular attention is devoted to AWGN channel with input restricted to m-PSK constellation with corresponding group structure Zm. We establish the exact asymptotic decay of the average symbol and word error probabilities when the interleaver length goes to infinity (interleaver gain)....
متن کاملCapacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels
ABSTRACT In this paper, we investigate the limitations of capacity-based random code constructions for the wiretap channel, i.e., constructions that associate to each confidential message a subcode whose rate approaches the capacity of the eavesdropper’s channel. Generalizing a previous result for binary symmetric channels, we show that random capacity-based codes do not achieve the strong secr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005